A special-purpose compiler

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Spark 2.0 System | a Special Purpose Vector Processor with a Vectorpascal Compiler

This paper describes the architecture of the Spark 2.0 processor and introduces a compiler for VectorPascal. Features of the architecture are the exible address generation during vector operations and the large memories closely connected to the functional units. The source language allows to write programs with vector statements avoiding scalar inner loops. The compiler employs several optimizi...

متن کامل

Special-Purpose Nickel Alloys

NICKEL-BASE ALLOYS have a number of unique properties, or combinations of properties, that allow them to be used in a variety of specialized applications. For example, the high resistivity (resistance to flow of electricity) and heat resistance of nickel-chromium alloys lead to their use as electric resistance heating elements. The soft magnetic properties of nickel-iron alloys are employed in ...

متن کامل

Special Purpose Parallel Computing

A vast amount of work has been done in recent years on the design, analysis, implementation and veriication of special purpose parallel computing systems. This paper presents a survey of various aspects of this work. A long, but by no means complete, bibliography is given.

متن کامل

SPART - A Special Purpose Asynchronous Receiver/Transmitter

In this miniproject, you are to implement a Special Purpose Asynchronous Receiver/Transmitter (SPART). The SPART can be integrated into the processor of your final project to serve as the serial I/O interface between the processor and a serial I/O port on NT workstation. Use the Hyperterminal Accessory, this will permit you to input characters from the keyboard and to output characters to the s...

متن کامل

A New Special-Purpose Factorization Algorithm

In this paper, a new factorization algorithm is presented, which finds a prime factor p of an integer n in time (D log n)O(1), if 4p − 1 = Db2 where D and b are integers. Hence this algorithm will factor a number efficiently, if it has a prime factor p such that 4p−1 is a product of a small integer and a square. Such primes should be avoided when we select the RSA secret keys. Some generalizati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Computer Journal

سال: 1965

ISSN: 0010-4620,1460-2067

DOI: 10.1093/comjnl/8.2.109